On extremal k-outconnected graphs
نویسندگان
چکیده
منابع مشابه
On extremal k-outconnected graphs
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n ≥ 3k− 2 then m ≤ k(n− k), and for n ≥ 3k− 1 an equality is possible if, and only if, G is the complete bipartite graph Kk,n−k. Cai proved that if n ≤ 3k − 2 then m ≤ b(n + k)2/8c, and listed the cases when this bound is tight. In this paper we prove a more general theorem, which implies similar results for m...
متن کاملOn extremal k-supereulerian graphs
A graph G is called k-supereulerian if it has a spanning even subgraph with at most k components. In this paper, we prove that any 2-edge-connected loopless graph of order n is ⌈(n − 2)/3⌉-supereulerian, with only one exception. This result solves a conjecture in [Z. Niu, L. Xiong, Even factor of a graphwith a bounded number of components, Australas. J. Combin. 48 (2010) 269–279]. As applicatio...
متن کاملApproximating k-outconnected Subgraph Problems
We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for nding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle th...
متن کاملExtremal K(s, t)-free bipartite graphs
Throughout this paper only undirected simple graphs (without loops or multiple edges) are considered. Unless stated otherwise, we follow the book by Bollobás [2] for undefined terminology and definitions. LetG = G(m,n) = G(X,Y ) denote a bipartite graph with vertex classesX and Y such that |X| = m and |Y | = n. A complete bipartite subgraph with s vertices in the class X and t vertices in the c...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.06.011